Vector-Valued Property Elicitation
نویسندگان
چکیده
The elicitation of a statistic, or property of a distribution, is the task of devising proper scoring rules, equivalently proper losses, which incentivize an agent or algorithm to truthfully estimate the desired property of the underlying probability distribution or data set. Leveraging connections between elicitation and convex analysis, we address the vector-valued property case, which has received little attention in the literature despite its applications to both machine learning and statistics. We first provide a very general characterization of linear and ratio-of-linear properties, the first of which resolves an open problem by unifying and strengthening several previous characterizations in machine learning and statistics. We then ask which vectors of properties admit nonseparable scores, which cannot be expressed as a sum of scores for each coordinate separately, a natural desideratum for machine learning. We show that linear and ratio-of-linear do admit nonseparable scores, and provide evidence for a conjecture that these are the only such properties (up to link functions). Finally, we give a general method for producing identification functions and address an open problem by showing that convex maximal level sets are insufficient for elicitability in general.
منابع مشابه
Lower semicontinuity for parametric set-valued vector equilibrium-like problems
A concept of weak $f$-property for a set-valued mapping is introduced, and then under some suitable assumptions, which do not involve any information about the solution set, the lower semicontinuity of the solution mapping to the parametric set-valued vector equilibrium-like problems are derived by using a density result and scalarization method, where the constraint set $K$...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملOnline Appendix Making the most of Our Regrets:Regret-based Solutions to Handle Payoff Uncertainty and Elicitation in Green Security Games
In fact, ARROW can be generalized for non-zero-sum games as it does not exploit the zero-sum property to solve behavioral MMR in the case of a boundedly rational attacker. For example, M.ARROW only applies the heuristic of local search with multiple random starting points, which can also be used in non-zero-sum games. In addition, the binary search and piecewise linear approximation methods use...
متن کاملIncremental Weight Elicitation for Multiobjective State Space Search
This paper proposes incremental preference elicitation methods for multiobjective state space search. Our approach consists in integrating weight elicitation and search to determine, in a vector-valued state-space graph, a solution path that best fits the Decision Maker’s preferences. We first assume that the objective weights are imprecisely known and propose a state space search procedure to ...
متن کاملSecond dual space of little $alpha$-Lipschitz vector-valued operator algebras
Let $(X,d)$ be an infinite compact metric space, let $(B,parallel . parallel)$ be a unital Banach space, and take $alpha in (0,1).$ In this work, at first we define the big and little $alpha$-Lipschitz vector-valued (B-valued) operator algebras, and consider the little $alpha$-lipschitz $B$-valued operator algebra, $lip_{alpha}(X,B)$. Then we characterize its second dual space.
متن کامل